Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
نویسندگان
چکیده
منابع مشابه
Rate-splitting multiple access for discrete memoryless channels
It is shown that the encoding/decoding problem for any asynchronous -user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2 1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of findi...
متن کاملComputation of the Capacity for Discrete Memoryless Channels and Sum Capacity of Multiple Access Channels with Causal Side Information at Receiver
Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for computing the capacity of discrete memoryles...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملNumerical Computation of the Capacity of Continuous Memoryless Channels
We extend the Blahut-Arimoto algorithm to continuous memoryless channels by means of sequential Monte Carlo integration in conjunction with steepest descent. As an illustration, we consider the peak power constrained AWGN channel.
متن کاملThe capacity of discrete-time memoryless Rayleigh-fading channels
We consider transmission over a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information. Subject to an average power constraint, we study the capacity-achieving distribution of this channel and prove it to be discrete with a finite number of mass points, one of them located at th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.836661